Apart from these differences, v2.4 is exactly like v2.0 of which only one copy has been distributed and whose documentation is included below:
mind trinkets v2.0 documentation
1994, Z｡ Software
written by Trebor Kepone
AOL: TreborK910
Internet: trebork910@aol.com
DigitalNATION: Skylab (but don't count on it, I don't log in often.)
phone: (919)-852-7311
I hope to have a native Internet account soon.
*** Click on the ﾒsplash screenﾓ or press "Return" to enter application ***
There are 4 primary things that are different with mind trinkets v2.0:
1> Eliminated "Unexpected Quit"s of error type 1 that was due to my not properly disposing handle memory.
2> Added a new puzzle.
3> Cut down on memory by using an included resource font instead of PICT files and by putting in solid colors where there was dithering.
4> Added a red, shiny apple in the menu bar.
All of these games (except for the one added in v2.0) contain some sort of cursory explanation concerning its objective, but I feel it necessary to elucidate.
･･ EULER'S PROBLEM:
In chess, the knight piece moves 2 spaces in a vertical or horizontal direction and 1 space in the perpendicular direction. The knight's possible movements from any square are shown below:
ú ú ú ú ú ú ú ú
ú ú ú ･ ú ･ ú ú
ú ú ･ ú ú ú ･ ú
ú ú ú ú -K- ú ú ú
ú ú ･ ú ú ú ･ ú
ú ú ú ･ ú ･ ú ú
ú ú ú ú ú ú ú ú
ú ú ú ú ú ú ú ú
The objective of Euler's problem is to move the knight around the board in a manner such that every square is visited once and only once. You can begin anywhere on the board, (click on the desired square at game beginning,) but after that, your movements must abide by the legal moves for a knight. The position of the most recent move is indicated by the color blue.
･･ THE TOWERS OF HANOI
You have probably played some variation of this game before. When you begin, you see a grid of 3 columns and 7 rows, the first column, or stack, colored green. And each of the seven green rectangles are called "levels". You can move these levels one at a time, and you can only move the top one from each stack. You cannot place a level on a stack if the latter contains a level or levels higher than the afore mentioned. The object of the game is to get all of the levels from stack #1 and place them on stack #3, however, to do this with all seven levels requires 127 moves, so, if you are worried about time, you can forget about the bottom 1 or 2 levels and just move the top 5 or 6 levels.
You move a level by clicking on the button indicating the stack from which you would like to take the top level, and then clicking on the button indicating the button to which you would like that level transported.
･･ BLOCKS
This is based on the old "Chinese Rings" toy. The purpose is to get all of the eight squares without enclosed boxes. You toggle the state of the square by clicking on it. The block to the far right can be freely turned on and off, but the others can be changed only if the one to the immediate right of it is occupied and all the others to the right are unoccupied. As with Towers of Hanoi, it takes a while to remove all eight, so you can just change the 5,6, or 7 nearest to the right.
･･ FROG-HOP
This is an upgrade of the Z｡ classic, Hop. The point is to get all of the green frogs to the right and all of the blue frogs to the left. The frogs can be hopped one at a time, moving only in the direction in which they are facing, by clicking them. The frogs move one space at a time, except when one is blocking it, and the space beyond the other is empty, in which case the frog moves ahead two spaces to the empty space.
･･ BASE 3
This game is much like another Z｡ game, Uberzweizehlig, only you are dealing with a base 3 board instead of a binary board. Unlike the other games in this collection, Base 3 is randomized, providing a different game each time you play. Here's how it goes:
When you begin, you will be faced with a 4x4 grid of random numbers from 0 to 3. It might look like this:
2 1 1 0
0 2 2 1
2 1 0 0
1 2 2 2
The object of the game is to get all of the tiles to have the same number. How do you change a tile's number? Well, you change it by clicking it. The number will increase by one; except when it is two, in which case it will change back to zero. So what is the complication? Well, whenever you click a tile, the adjacent ones change in an according manner.
So if you clicked here:
ﾗ ﾗ ﾗ ﾗ
･ ﾗ ﾗ ﾗ the ones that are
ﾗ ﾗ ﾗ ﾗ altered are....
ﾗ ﾗ ﾗ ﾗ
･ ･ ･ ﾗ
･ ･ ･ ﾗ
･ ･ ･ ﾗ
ﾗ ﾗ ﾗ ﾗ
So if you click in the puzzle listed above in the position directly above, the result would look like this:
0 2 1 0
1 0 2 1
0 2 0 0
1 2 2 2
And, once again, the object is to get all of them the same number. This is tricky, so don't get too discouraged.
If you have any questions or comments concerning this program (as well as any other puzzles to be added in future versions,) Please write to me:
Trebor Kepone, Z｡ Software
508 Arrowhead Drive,
Greensboro, NC, 27410.
America Online at TreborK910
Internet TreborK910@aol.com
Look for other Z｡ programs under keyword "Kepone"
Feel free to give away unmodified copies of this program, provided this document is included. If you, your students, or your children enjoy this program, please write me a letter, a postcard, or send a donation of $5.00, or a disk filled with shareware.
Just as an experiment, every time you redistribute this program, I ask you to please change the color scheme of the desktop icon using ResEdit or any other icon-editing utility. You usually won't be able to see the changed colors unless you rebuild your desktop, but others to whom you lend it will. This way, nearly every copy will be individualized. (The initial coloring was cyan for the face and black for the border in 256 colors, magenta and black for 16 colors.)
